Cooperative task planning of multi-robot systems with temporal constraints

نویسندگان

  • Feng-Li Lian
  • Richard M. Murray
چکیده

This paper discusses a design methodology of cooperative trajectory generation for multi-robot systems. The trajectory of achieving cooperative tasks, i.e., with temporal constraints, is constructed hy a nonlinear trajectory generation (NTG) algorithm. Three scenarios of multi-robot tasking are proposed at the cooperative task planning framework. The NTG algorithm is, then, used to generate real-time trajectory for desired robot activities. Given robot dynamics and constraints, the NTG algorithm first finds trajeclory in a lower dimensional space and parameterizes the curves by a set of B-spline representations. The coefficients of the B-splines are further solved by sequential quadratic programming to satisfy the optimization objectives and constraints. The NTG algorithm has been implemented to generate real-time trajectories for a group of cooperative robots in the presence of spatial and temporal constraints. Finally, an illustrated example of cooperative task planning with temporal constraints is pmeuted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Path Planning of Dynamical Multi-Agent Systems Using Differential Flatness Approach

This paper discusses a design methodology of cooperative path planning for dynamical multi-agent systems with spatial and temporal constraints. The cooperative behavior of the multi-agent systems is specified in terms of the objective function in an optimization formulation. The path of achieving cooperative tasks is then generated by the optimization formulation constructed based on a differen...

متن کامل

Scaling the Dynamic Approach to Path Planning and Control: Competition among Behavioral Constraints

The dynamic systems approach to robot path planning de nes a \dynamics" of robot behavior in which task constraints contribute independently to a nonlinear vector eld that governs robot actions. We address problems that arise in scaling this approach to handle complex behavioral requirements. We propose a dynamics that operates in the space of task constraints, determining the relative contribu...

متن کامل

Simultaneous Task Allocation and Planning Under Uncertainty

We propose novel techniques for task allocation and planning in multi-robot systems operating in uncertain environments. Task allocation is performed simultaneously with planning, which provides more detailed information about individual robot behaviour, but also exploits the independence between tasks to do so efficiently. We use Markov decision processes to model robot behaviour and linear te...

متن کامل

Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems

Multi-robot task allocation determines the task sequence and distribution for a group of robots in multi-robot systems, which is one of constrained combinatorial optimization problems and more complex in case of cooperative tasks because they introduce additional spatial and temporal constraints. To solve multi-robot task allocation problems with cooperative tasks efficiently, a subpopulation-b...

متن کامل

An architecture for distributed cooperative planning in a behaviour-based multi-robot system

The Architecture for Behaviour-Based Agents (ABBA) is an architecture designed to illustrate that situated agents can exhibit sophisticated planning while retaining reactivity, without resorting to hybrid architectures. In particular, unified planning for spatial and topological navigation, cooperation and communication can be achieved using an appropriate actionselection scheme. Joint-planning...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003